Single-machine batch scheduling minimizing weighted flow times and delivery costs with job release times
نویسندگان
چکیده
منابع مشابه
Single-machine scheduling with stepwise tardiness costs and release times
We study a scheduling problem that belongs to the yard operations component of the railroad planning problems, namely the hump sequencing problem. The scheduling problem is characterized as a single-machine problem with stepwise tardiness cost objectives. This is a new scheduling criterion which is also relevant in the context of traditional machine scheduling problems. We produce complexity re...
متن کاملMinimizing the Weighted Number of Late Jobs with Batch Setup Times and Delivery Costs on a Single Machine
We study a single machine scheduling problem with batch setup time and batch delivery cost. In this problem, n jobs have to be scheduled on a single machine and delivered to a customer. Each job has a due date, a processing time and a weight. To save delivery cost, several jobs can be delivered together as a batch including the late jobs. The completion (delivery) time of each job in the same b...
متن کاملSingle-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs
This paper deals with a single-machine scheduling problem in which jobs are released in different points in time but delivered to customers in batches. A due window is associated with each job. The objective is to schedule the jobs, to form them into batches and to decide the delivery date of each batch so as to minimize the sum of earliness, tardiness, holding, and delivery costs. A mathematic...
متن کاملSingle machine batch scheduling problem with family setup times and release dates to minimize makespan
In this paper we consider the single machine batch scheduling problem with family setup times and release dates to minimize makespan. We show that this problem is strongly NP-hard, and give an O n n m + 1 m time dynamic programming algorithm and an O(mk k P 2k−1) time dynamic programming algorithm for the problem, where n is the number of jobs, m is the number of families, k is the number of di...
متن کاملParallel machine scheduling with batch delivery costs
We consider a scheduling problem in which n independent and simultaneously available jobs are to be processed on m parallel machines. The jobs are delivered in batches and the delivery date of a batch is equal to the completion time of the last job in the batch. The delivery cost depends on the number of deliveries. The objective is to minimize the sum of the total #ow time and delivery cost. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: international journal of industrial engineering computations
سال: 2012
ISSN: 1923-2926,1923-2934
DOI: 10.5267/j.ijiec.2012.01.004